Variable-Length Feedback Codes Under a Strict Delay Constraint
نویسندگان
چکیده
منابع مشابه
Moderate Deviation Asymptotics for Variable-Length Codes with Feedback
We consider data transmission across discrete memoryless channels (DMCs) using variable-length codes with feedback. We consider the family of such codes whose rates are ρN below the channel capacity C, where ρN is a positive sequence that tends to zero slower than the reciprocal of the square root of the expectation of the (random) blocklength N . This is known as the moderate deviations regime...
متن کاملNeyman-Pearson classification under a strict constraint
Motivated by problems of anomaly detection, this paper implements the Neyman-Pearson paradigm to deal with asymmetric errors in binary classification with a convex loss. Given a finite collection of classifiers, we combine them and obtain a new classifier that satisfies simultaneously the two following properties with high probability: (i), its probability of type I error is below a pre-specifi...
متن کاملA Study of Variable Length Error Correcting Codes and Reversible Variable Length Codes: Analysis and Applications
is an authentic record of my work carried out under the supervision of Prof. N. Kalyanasundaram and Prof. Bhudev Sharma. I have not submitted this work elsewhere for any other degree or diploma. I am fully responsible for the contents of my Ph.D. Thesis. is a bonafide record of her original work carried out under our supervision. This work has not been submitted elsewhere for any other degree o...
متن کاملDirectly Addressable Variable-Length Codes
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sampling method. The technique is practical and has many applications to the representation of ordered sets, sparse bitmaps, partial sums, and compressed data structures for suffix trees, arrays, and inverted indexes, to...
متن کاملExtractive Summarization under Strict Length Constraints
In this paper we report a comparison of various techniques for single-document extractive summarization under strict length budgets, which is a common commercial use case (e.g. summarization of news articles by news aggregators). We show that, evaluated using ROUGE, numerous algorithms from the literature fail to beat a simple lead-based baseline for this task. However, a supervised approach wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2015
ISSN: 1089-7798
DOI: 10.1109/lcomm.2015.2398866